%0 Journal Article
%4 dpi.inpe.br/plutao/2012/11.28.18.16
%2 dpi.inpe.br/plutao/2012/11.28.18.16.51
%@issn 0104-530X
%F lattes: 6187221670775160 3 ChavesSennYana:2012:NoHePr
%T Uma nova heurística para o problema de minimização de trocas de ferramentas
%D 2012
%A Chaves, Antonio Augusto,
%A Senne, Edson Luiz França,
%A Yanasse, Horacio Hideki,
%@affiliation Instituto de Ciência e Tecnologia - ICT, Universidade Federal de São Paulo - UNIFESP, Rua Talim, 330, CEP 12231-280, São José dos Campos, SP, Brazil
%@affiliation Universidade Estadual Paulista - UNESP, Av. Ariberto Pereira da Cunha, 333, CEP 12516-410, Guaratinguetá, SP, Brazil
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@electronicmailaddress
%@electronicmailaddress
%@electronicmailaddress horacio@lac.inpe.br
%B Gestão & Produção
%V 19
%N 1
%P 17-30
%K Graph, Heuristic, Metaheuristic, Scheduling, Tool switches, problema de sequenciamento, minimização de trocas de ferramentas, Heuristicas, metaheurísticas.
%X The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. This study presents a new heuristic for the MTSP. This heuristic has two phases: a constructive phase, based on a graph where the vertices correspond to tools and there is an arc k = (i, j) linking vertices i and j if and only if the tools i and j are required to execute some job; and an improvement phase, based on an Iterated Local Search. Computational results show that the proposed heuristic has a good performance on the instances tested contributing to a significant reduction in the number of nodes generated by an enumerative algorithm.
%@language pt
%3 a02v19n1.pdf